Rule Representations in a Connectionist Chunker

نویسندگان

  • David S. Touretzky
  • Gillette Elvgreen
چکیده

We present two connectionist architectures for chunking of symbolic rewrite rules. One uses backpropagation learning, the other competitive learning. Although they were developed for chunking the same sorts of rules, the two differ in their representational abilities and learning behaviors.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connectionist Models of Rule-Based Reasoning

We investigate connectionist models of rule-based reasoning, and show that while such models usually carry out reasoning in exactly the same way as symbolic systems, they have more to ooer in terms of commonsense reasoning. A connection-ist architecture for commonsense reasoning, CON-SYDERR, is proposed to account for common-sense reasoning patterns and to remedy the brit-tleness problem in tra...

متن کامل

A Connectionist Framework for Reasoning : Reasoning

We present a connectionist architecture that supports almost instantaneous deductive and abductive reasoning. The deduction algorithm responds in few steps for single rule queries and in general, takes time that is linear with the number of rules in the query. The abduction algorithm produces an explanation in few steps and the best explanation in time linear with the size of the assumption set...

متن کامل

Connectionist inference models

The performance of symbolic inference tasks has long been a challenge to connectionists. In this paper, we present an extended survey of this area. Existing connectionist inference systems are reviewed, with particular reference to how they perform variable binding and rule-based reasoning and whether they involve distributed or localist representations. The benefits and disadvantages of differ...

متن کامل

Preprint of Paper ‘Connectionist Inference Models’ to appear in Neural Networks

The performance of symbolic inference tasks has long been a challenge to connectionists.In this paper, we present an extended survey of this area. Existing connectionist inference systems are reviewed, with particular reference to how they perform variable binding and rule-based reasoning and whether they involve distributed or localist representations. The benefits and disadvantages of differe...

متن کامل

A Connectionist Model for Commonsense Reasoning Incorporating Rules and Similarities

1 SUMMARY For the purpose of modeling commonsense reasoning, we investigate connectionist models of rule-based reasoning, and show that while such models can usually carry out reasoning in exactly the same way as symbolic systems, they have more to oer in terms of commonsense reasoning. A connectionist architecture, CONSYDERR, is proposed for capturing certain commonsense reasoning competence, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1989